Network design using the characteristic polynomial
نویسندگان
چکیده
منابع مشابه
assessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
Characteristic Polynomial
A [ An−1 + p1A n−2 + · · ·+ pn−1 In ] = −pn In . Since A is nonsingular, pn = (−1)n det(A) 6= 0; thus the result follows. Newton’s Identity. Let λ1, λ2, . . . , λn be the roots of the polynomial K(λ) = λ + p1λ n−1 + p2λ n−2 + · · · · · ·+ pn−1λ+ pn. If sk = λ k 1 + λ k 2 + · · ·+ λn, then pk = − 1 k (sk + sk−1 p1 + sk−2 p2 + · · ·+ s2 pk−2p1 + s1 pk−1) . Proof. From K(λ) = (λ − λ1)(λ − λ2) . . ...
متن کاملFast PDA Synchronization Using Characteristic Polynomial Interpolationy
Modern Personal Digital Assistant (PDA) architectures often use a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient, in terms of bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync) based...
متن کاملFast PDA Synchronization Using Characteristic Polynomial Interpolation
Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient with respect to bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync...
متن کاملFactorization of the Characteristic Polynomial
We introduce a new method for showing that the roots of the characteristic polynomial of a finite lattice are all nonnegative integers. Our main theorem gives two simple conditions under which the characteristic polynomial factors in this way. We will see that Stanley’s Supersolvability Theorem is a corollary of this result. We can also use this method to demonstrate the factorization of a poly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1984
ISSN: 0307-904X
DOI: 10.1016/0307-904x(84)90148-3